On defining groups efficiently without using inverses
نویسندگان
چکیده
Let G be a group, and let 〈A |R 〉 be a finite group presentation for G with |R| ≥ |A|. Then there exists a finite semigroup presentation 〈 B |Q 〉 for G such that |Q| − |B| = |R| − |A|. Moreover, B is either the same generating set or else it contains one additional generator.
منابع مشابه
On the product of projectors and generalized inverses
We consider generalized inverses of linear operators on arbitrary vector spaces and study the question when their product in reverse order is again a generalized inverse. It turns out that this problem is equivalent to the question when the product of projectors is again a projector, and we discuss necessary and sufficient conditions in terms of the defining spaces. We present a new representat...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملIterative Methods for Computing Generalized Inverses of Matrices
AB:The subject of investigation of the doctoral dissertation is the calculation ofgeneralized inverses of matrices, as well as the connection between thegeneralized inverses of matrices with the optimization theory concepts. Thereare defined new iterative methods for solving optimization problems. Aspecial attention is devoted on defining new iterative methods for generalize...
متن کاملPicture Groups and Maximal Green Sequences
We show that picture groups are directly related to maximal green sequence. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without inverses) for the coxeter element of the picture groups.
متن کاملNew results on the quasi-commuting inverses
A matrix has an ordinary inverse only if it is square, and even then only if it is nonsingular or, inother words, if its columns (or rows) are linearly independent. In recent years needs have been felt innumerous areas of applied mathematics for some kind of partial inverse of a matrix that is singularor even rectangular. In this paper, some results on the Quasi-commuting inverses, are given an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005